Parallel Sorting in Two-Dimensional VLSI Models of Computation
نویسندگان
چکیده
منابع مشابه
An Optimal Parallel Radix Sorting Algorithm on Two and Three Dimensional Meshes for VLSI Computation
1 Abtract We consider radix sorting problems on two-dimensional mesh and three-dimensional mesh. By employing the radix sorting, we removed the necessity of comparator. Compared with previous sorting algorithms on the meshes which perform sorting based on comparison, our algorithm can be implemented on a simpler mesh since each processing element does not include the logic circuit for compariso...
متن کاملOptimization of Agricultural BMPs Using a Parallel Computing Based Multi-Objective Optimization Algorithm
Beneficial Management Practices (BMPs) are important measures for reducing agricultural non-point source (NPS) pollution. However, selection of BMPs for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. Due to its iterative nature, the optimization typically takes a long time to achieve the BMP trade-off results which is not desirable ...
متن کاملDesign, Development and Evaluation of an Orange Sorter Based on Machine Vision and Artificial Neural Network Techniques
ABSTRACT- The high production of orange fruit in Iran calls for quality sorting of this product as a requirement for entering global markets. This study was devoted to the development of an automatic fruit sorter based on size. The hardware consisted of two units. An image acquisition apparatus equipped with a camera, a robotic arm and controller circuits. The second unit consisted of a robotic...
متن کاملParallel Algorithms and Structures for Implementation of Merge Sort
I. INTODACTION The development of information technologies is characterized by the expansion of applications, many of which requires parallel sorting of data sets in real-time. You can provide such data sorting by using of specialized tools, which architecture maps the structure of the sorting algorithm on hardware and is oriented on VLSI implementation. Implementation of highly efficient speci...
متن کاملEfficient Parallel Algorithms for Optical Computing with the DFT Primitive
The optical computing technology ooers new challenges to the algorithm designers since it can perform an n-point DFT computation in only unit time. Note that DFT is a non-trivial computation in the PRAM model. We develop two new models, DFT-VLSIO and DFT-Circuit, to capture this characteristic of optical computing. We also provide two paradigms for developing parallel algorithms in these models...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 38 شماره
صفحات -
تاریخ انتشار 1989